Balancing earliness and tardiness within workload control order release: an assessment by simulation

نویسندگان

چکیده

Abstract Most Workload Control literature assumes that delivery performance is determined by tardiness related measures only. While this may be true for companies directly deliver to end-customers, make-to-stock or firms are part of supply chains, producing early often means large inventories in the finished goods warehouse penalties incurred downstream chain. Some earlier studies used a so-called time limit, which constrains set jobs can considered order release, reduce earliness. However, recent largely abandoned limit since it negatively impacts performance. This study revisits assessing use different adaptive policies restrict its periods either low high load. By using simulation model pure job shop, shows an policy allows balance contradictory objectives delaying release orders earliness and respond load as quick possible. Meanwhile, only was found best policy.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An efficient algorithm for the earliness-tardiness scheduling problem

This paper addresses the one-machine scheduling problem with earliness-tardiness penalties. We propose a new branch-and-bound algorithm that can solve instances with up to 50 jobs and that can solve problems with even more general non-convex cost functions. The algorithm is based on the combination of a Lagrangean relaxation of resource constraints and new dominance rules.

متن کامل

A Case Study on Earliness/Tardiness Scheduling by Constraint Programming

The aim of this paper is to solve a problem on scheduling with earliness and tardiness costs using constraint programming approach, and to compare the results with the ones from the original timed automata approach. The case study, a production of lacquers, includes some real life features like operating hours or changeover times. Considering the earliness and tardiness costs of the case study,...

متن کامل

Preemption in Single Machine Earliness/Tardiness Scheduling

We consider a single machine earliness/tardiness scheduling problem with general weights, ready times and due dates. Using completion time information obtained from the optimal solution to a preemptive relaxation, we generate feasible solutions to the original non-preemptive problem. We report extensive computational results demonstrating the speed and effectiveness of this approach.

متن کامل

Dynasearch neighborhood for the earliness-tardiness scheduling problem with release dates and setup constraints

The one-machine scheduling problem with sequence-dependent setup times and costs and earliness-tardiness penalties is addressed. This problem is NP-complete, so that local search approaches are very useful to efficiently find good feasible schedules. In this paper, we present an extension of the dynasearch neighborhood for this problem. Finding the best schedule in this neighborhood is shown to...

متن کامل

Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates

This paper presents new elimination rules for the Single Machine Problem with general earliness and tardiness penalties subject to release dates. These rules, based on a Lagrangian decomposition, allow to drastically reduce the execution windows of the jobs. We measure the efficiency of these properties by integrating them in a Branch-and-Bound. Tests show that instances with up to 70 jobs with...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Flexible Services and Manufacturing Journal

سال: 2022

ISSN: ['1936-6582', '1936-6590']

DOI: https://doi.org/10.1007/s10696-021-09440-9